The social problems surrounding doctor's certificates
نویسندگان
چکیده
منابع مشابه
Collocated social practices surrounding photographs
Recent developments in technology mean that it is becoming increasingly possible to support collaboration around digital photos. This makes an exploration of the existing collocated social practices that are associated with photos both timely and relevant. This workshop will explore social practices in the areas of photowork, photo sharing and photo displays, with the aim of drawing together cu...
متن کاملCollocated Social Practices Surrounding Photos
Without doubt, digital photographs have become the primary visual medium we use to capture, save and recollect our experiences. Consequently, the ways we interact with digital photos, archive them and share them have become cornerstone subjects in Human-Computer Interaction (HCI). In particular, a growing body of research in HCI has amassed around what can best be described as the collocated so...
متن کاملAccuracy Certificates for Computational Problems with Convex Structure
The goal of this paper is to introduce the notion of certificates, which verify the accuracy of solutions of computational problems with convex structure. Such problems include minimizing convex functions, variational inequalities with monotone operators, computing saddle points of convex-concave functions, and solving convex Nash equilibrium problems. We demonstrate how the implementation of t...
متن کاملAbout one class polynomial problems with not polynomial certificates
About one class polynomial problems with not polynomial certificates Kochkarev B.S. Abstract. We build a class of polynomial problems with not polynomial certificates. The parameter concerning which are defined efficiency of corresponding algorithms is the number n of elements of the set has used at construction of combinatory objects (families of subsets) with necessary properties. Let Σ = {0,...
متن کاملComputing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Systems of polynomial equations with coefficients over a field K can be used to concisely model combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution over the algebraic closure of the field K. In this paper, we investigate an algorithm aimed at proving combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Medical Association
سال: 2014
ISSN: 1975-8456,2093-5951
DOI: 10.5124/jkma.2014.57.7.580